A reduced-complexity algorithm for combined equalization and decoding

نویسندگان

  • Dan Raphaeli
  • Tal Kaitz
چکیده

This paper presents a new application of a suboptimal trellis decoding algorithm for combined equalization and decoding. The proposed algorithm can outperform the reduced-state sequence estimator (RSSE) of the same order of complexity. The algorithm, termed estimated future decision-feedback algorithm (EFDFA), was originally proposed for the problem of noncoherent decoding with multiple-symbol overlapped observations and is now reformulated for the problem of intersymbol interference inflicted channels. The EFDFA uses the RSSE as a building block. The performance improvement is achieved by using estimated future symbols in the decision process. The estimated future symbols are obtained by RSSE decoding time-reversed blocks of the input. The same technique can be used to greatly enhance the performance of the conventional decision-feedback equalizer. An analysis of the performance of the EFDFA based on the performance of the RSSE is described. The EFDFA can be configured as an adaptive equalizer capable of operating in a time-varying environment, and is shown to perform well in fading conditions. With only minor additional complexity, the EFDFA is also capable of producing soft outputs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Iterative equalization/decoding of LDPC code transmitted over MIMO fading ISI channels

Abstract— We propose a spectrum efficient and robust space-timefrequency code system for a MIMO, -tap fading channel. The LDPC code is employed at the transmitter and iterative maximum a posteriori (MAP) equalizers are used at the receiver. We propose a novel, reducedcomplexity iterative decoding and equalization scheme in which we combine the message-passing decoder, on the Bipartite graph for...

متن کامل

Comdined Turbo Block Decoding and Equalisation

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...

متن کامل

Combined Blind Equalization and Turbo Decoding

A b d m c t We describe parallel concatenated codes for, communication in the presence of intersymbol interference (ISI). Two iterative decoder structures which combine channel equalization and turbo decoding are presented. The first one combines the trellis representing each one of the constituent encoders with the IS1 trellis and performs slightly better that the second structure, which treat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2000